A SCALABLE SYSTEM-ON-A-CHIP ARCHITECTURE FOR PRIME NUMBER VALIDATION Ray C.C. Cheung and Ashley Brown Department of Computing, Imperial College London, United Kingdom Abstract This paper presents a scalable SoC architect

Source URL: www.ashleybrown.co.uk

• Number theory
• Modular arithmetic
• Finite fields
• Probabilistic complexity theory
• Multiplication
• Miller–Rabin primality test
• Field-programmable gate array
• Montgomery reduction
• Randomized algorithm
• Mathematics
• Primality tests
• Cryptography

FINDING COMPOSITE ORDER ORDINARY ELLIPTIC CURVES USING THE COCKS-PINCH METHOD D. BONEH, K. RUBIN, AND A. SILVERBERG Abstract. We apply the Cocks-Pinch method to obtain pairing-friendly composite order groups with prescri

Source URL: eprint.iacr.org

• Elliptic curves
• Finite fields
• Modular arithmetic
• Integer factorization algorithms
• Elliptic curve
• Supersingular elliptic curve
• Prime number
• Quadratic reciprocity
• Primality test
• Abstract algebra
• Mathematics
• Number theory

The Correctness of the AKS Primality Test in Coq∗ Fl´avio L. C. de Moura1 , Ricardo Tadeu1 1 Departamento de Ciˆencia da Computac¸a˜ o – Universidade de Bras´ılia (UnB) Caixa Postal 4466 – CEP[removed] – B

Source URL: www.cic.unb.br

• Primality tests
• Finite fields
• Integer sequences
• Modular arithmetic
• AKS primality test
• Prime number
• XTR
• Coprime
• Primality certificate
• Mathematics
• Abstract algebra
• Number theory

PDF Document

Source URL: www.kurims.kyoto-u.ac.jp

• Modular arithmetic
• Carmichael number
• Pseudoprimes
• Prime number
• Primality test
• Coprime
• Mathematics
• Integer sequences
• Number theory

This is a Chapter from the Handbook of Applied Cryptography, by A. Menezes, P. van Oorschot, and S. Vanstone, CRC Press, 1996. For further information, see www.cacr.math.uwaterloo.ca/hac CRC Press has granted the followi

Source URL: cacr.uwaterloo.ca

• Pseudoprimes
• Modular arithmetic
• Abstract algebra
• Miller–Rabin primality test
• Solovay–Strassen primality test
• Probable prime
• Fermat primality test
• Prime number
• Strong pseudoprime
• Mathematics
• Number theory
• Primality tests

PDF Document

Source URL: www.kurims.kyoto-u.ac.jp

• Integer sequences
• Lucas pseudoprime
• Modular arithmetic
• Recurrence relations
• Derrick Henry Lehmer
• Prime number
• Lucas sequence
• Lehmer
• Primality test
• Mathematics
• Number theory
• Pseudoprimes

BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 42, Number 1, Pages 3–38 S[removed][removed]Article electronically published on September 30, 2004

Source URL: www.ams.org

• Cryptography
• Integer sequences
• Finite fields
• Modular arithmetic
• Complexity classes
• AKS primality test
• Prime number
• Integer factorization
• NP
• Mathematics
• Primality tests
• Number theory

Philosophia Mathematica (III[removed]), 341–362. doi:[removed]philmat/nkn032 Advance Access publication November 6, 2008 Probabilistic Proofs and Transferability†

Source URL: fitelson.org

• Mathematical proofs
• Mathematical logic
• Philosophical logic
• Probabilistic method
• Prime number
• Philosophy of mathematics
• Theorem
• Miller–Rabin primality test
• Proof theory
• Mathematics
• Logic
• Logical syntax

[removed]Eric Kimball* ([removed]). Frobenius Pseudoprimes and a Cubic Primality Test. Preliminary report. An integer, n, is called a Frobenius probable prime with respect to a polynomial when it passes the F

Source URL: www.ams.org

Problems in Elementary Number Theory Peter Vandendriessche Hojoo Lee July 11, 2007

Source URL: www.math.muni.cz

• Coprime
• Divisor
• Collatz conjecture
• Prime number
• Factorial
• Primality test
• Floor and ceiling functions
• Gaussian integer
• Binomial coefficient
• Mathematics
• Number theory
• Integer sequences